A low cost Arnoldi method for large linear initial value problems
نویسنده
چکیده
In this paper we introduce a low cost method for integrating large dimensional linear initial value problems based on the Arnoldi algorithm for matrix functions. We also describe a very efficient step-size control technique and compare a resulting algorithm of order 4 with the standard Matlab solvers on linear stiff problems arising from the discretization of parabolic equations.
منابع مشابه
Some new restart vectors for explicitly restarted Arnoldi method
The explicitly restarted Arnoldi method (ERAM) can be used to find some eigenvalues of large and sparse matrices. However, it has been shown that even this method may fail to converge. In this paper, we present two new methods to accelerate the convergence of ERAM algorithm. In these methods, we apply two strategies for the updated initial vector in each restart cycles. The implementation of th...
متن کاملA Parallel Overlapping Time-Domain Decomposition Method for ODEs
We introduce an overlapping time-domain decomposition for linear initial-value 7 problems which gives rise to an efficient solution method for parallel computers without 8 resorting to the frequency domain. This parallel method exploits the fact that homogeneous 9 initial-value problems can be integrated much faster than inhomogeneous problems by using 10 an efficient Arnoldi approximation for ...
متن کاملResidual Arnoldi Methods : Theory ,
Title of dissertation: Residual Arnoldi Methods : Theory, Package, and Experiments Che-Rung Lee, Doctor of Philosophy, 2007 Dissertation directed by: Professor G.W. Stewart Department of Computer Science This thesis is concerned with the solution of large-scale eigenvalue problems. Although there are good algorithms for solving small dense eigenvalue problems, the large-scale eigenproblem has m...
متن کاملRowmap { a Row-code with Krylov Techniques for Large Stii Odes
We present a Krylov-W-code ROWMAP for the integration of stii initial value problems. It is based on the ROW-methods of the code ROS4 of Hairer and Wanner and uses Krylov techniques for the solution of linear systems. A special multiple Arnoldi process ensures order p = 4 already for fairly low dimensions of the Krylov subspaces independently of the dimension of the diierential equations. Numer...
متن کاملKrylov Subspace Approximation for TEM Simulation in the Time Domain
Forward transient electromagnetic modeling requires the numerical solution of a linear constant-coefficient initial-value problem for the quasi-static Maxwell equations. After discretization in space this problem reduces to a large system of ordinary differential equations, which is typically solved using finite-difference time-stepping. We compare standard time-stepping schemes such as the exp...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Math.
دوره 81 شماره
صفحات -
تاریخ انتشار 2004